package shuanfa.tree;

public class BinaryTreeDemo {
    public static void main(String[] args) {
        //创建二叉树
        BinaryTree binaryTree=new BinaryTree();
        //创建所需节点
        HeroNode root=new HeroNode(1,"松江");
        HeroNode node2=new HeroNode(2,"吴用");
        HeroNode node3=new HeroNode(3,"卢俊义");
        HeroNode node4=new HeroNode(4,"林冲");
        root.setLeft(node2);
        root.setRight(node3);
        node3.setRight(node4);
        binaryTree.setRoot(root);
        //测试遍历
        System.out.println("前序遍历");
        binaryTree.preOrder();

        System.out.println("中序遍历");
        binaryTree.infixOrder();

        System.out.println("后序遍历");
        binaryTree.postOrder();

        //测试遍历查找
        System.out.println("前序遍历查找");
        HeroNode heroNode = binaryTree.proOrderSearch(2);
        System.out.println(heroNode);
    }
}
class BinaryTree{
    private HeroNode root;

    public void setRoot(HeroNode root) {
        this.root = root;
    }
    //前序遍历
    public void preOrder(){
        if (this.root!=null){
            this.root.preOrder();
        }else {
            System.out.println("二叉树为空，无法遍历");
        }
    }
    //中序遍历
    public void infixOrder(){
        if (this.root!=null){
            this.root.infixOrder();
        }else {
            System.out.println("二叉树为空，无法遍历");
        }
    }
    //后序遍历
    public void postOrder(){
        if (this.root!=null){
            this.root.postOrder();
        }else {
            System.out.println("二叉树为空，无法遍历");
        }
    }
    //前序遍历查找
    public HeroNode proOrderSearch(int no){
        if (this.root!=null){
            HeroNode heroNode = this.root.proOrderSearch(no);
            return heroNode;
        }
        return null;
    }
}
class HeroNode{
    private int no;
    private String name;
    private HeroNode left;
    private HeroNode right;

    public HeroNode() {
    }

    public HeroNode(int no, String name) {
        this.no = no;
        this.name = name;
    }

    public int getNo() {
        return no;
    }

    public void setNo(int no) {
        this.no = no;
    }

    public HeroNode getLeft() {
        return left;
    }

    public void setLeft(HeroNode left) {
        this.left = left;
    }

    public HeroNode getRight() {
        return right;
    }

    public void setRight(HeroNode right) {
        this.right = right;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    @Override
    public String toString() {
        return "HeroNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                '}';
    }
    //先序遍历
    public void preOrder(){
        System.out.println(this);//输出父节点
        if (this.left!=null){
            this.left.preOrder();//递归向左子树先序遍历
        }
        if (this.right!=null){
            this.right.preOrder();//递归向右子树先序遍历
        }
    }
    //中序遍历
    public void infixOrder(){
        if (this.left!=null){
            this.left.infixOrder();//递归向左子树中序遍历
        }
        System.out.println(this);//输出父节点
        if(this.right!=null){
            this.right.infixOrder();//递归向右子树中序遍历
        }
    }
    //后序遍历
    public void postOrder(){
        if (this.left!=null){
            this.left.postOrder();//递归向左子树后序遍历
        }
        if (this.right!=null){
            this.right.postOrder();//递归向右子树后序遍历
        }
        System.out.println(this);//输出父节点
    }
    //前序遍历查找
    public HeroNode proOrderSearch(int no){
        if (this.no==no){
            return this;
        }
        HeroNode resNode=null;
        if (this.left !=null){
            resNode= this.left.proOrderSearch(no);
        }
        if (resNode!=null){
            return resNode;
        }
        if (this.right!=null){
            resNode=this.right.proOrderSearch(no);
        }
        return resNode;
    }
}
